Determining active sensor nodes for complete coverage without location information

نویسندگان

  • Tzu-Ting Wu
  • Kuo-Feng Ssu
چکیده

Selecting a partial set of sensor nodes for execution and still maintaining the system sensing coverage is an important issue in wireless sensor networks. The previous research was concentrated on the location-aware sensor networks but little attention has been devoted to the location-free environments. This paper describes an approach to determining active nodes for full coverage without location information. Such environment can not provide sufficient information to detect blind spots. A triangular self-test mechanism is developed to examine the existence of blind areas and to remove the blind spots by activate sleeping sensor nodes. The selection mechanism was evaluated using network simulator ns-2 Two other related algorithms, PEAS and OGDC, were also implemented for performance comparison. The simulation measured the metrics in control overhead, size of the active set, and the sensing coverage. The results show that our algorithm aids profit in network scalability, energy efficiency, and number of active sensor nodes without the need of location information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Improvement of Coverage Algorithm in WSN in Terms of Sensor Numbers and Power Amount

Wireless sensor networks(WSN) have unique properties that distinguished them from other wireless networks and have special challenges. Not-chargeable, not-changeable and limited power supplies of sensor nodes is the most important challenge of this networks, and if the power supply of node expired, a part of data maybe lost. Because of the importance of covers in wireless sensors, in this work ...

متن کامل

A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks

The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of the WSN by turning off redundant nodes. In this paper, we propose a mathematical method for calculating the coverage fraction in WSNs. According to the method, each active node can evaluate its sensing area whether c...

متن کامل

Three Dimensional Localization of an Unknown Target Using Two Heterogeneous Sensors

Heterogeneous wireless sensor networks consist of some different types of sensor nodes deployed in a particular area. Different sensor types can measure different quantity of a source and using the combination of different measurement techniques, the minimum number of necessary sensors is reduced in localization problems. In this paper, we focus on the single source localization in a heterogene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJAHUC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2005